An efficientg-centroid location algorithm for cographs
نویسندگان
چکیده
منابع مشابه
An efficient g-centroid location algorithm for cographs
In 1998, Pandu Rangan et al. proved that locating the g-centroid for an arbitrary graph is -hard by reducing the problem of finding the maximum clique size of a graph to the g-centroid location problem. They have also given an efficient polynomial time algorithm for locating the g-centroid for maximal outerplanar graphs, Ptolemaic graphs, and split graphs. In this paper, we present an O(nm) tim...
متن کاملAn improved g-centroid location algorithm for Ptolemaic graphs
We have presented an 2 ( ) O m time algorithm for locating the g-centroid for Ptolemaic graphs, where n is the number of edges and m is the number of vertices of the graph under consideration [6]. If the graph is sparse (i.e. = ( ) m O n ) then the algorithm presented will output the g-centroid in quadratic time. However, for several practical applications, the graph under consideration will be...
متن کاملAn optimal parallel matching algorithm for cographs
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an $n$-vertex cograph $G$ represented by its parse tree as input, our algorithm finds a maximum matching in...
متن کاملAn Improved Centroid Localization algorithm for WSN
In wireless sensor networks (WSN) research area, node localization is one of the most important techniques. An improved Centroid localization algorithm is analyzed and an improved Centroid algorithm with selective anchor node localization algorithm (CSA) for WSN will proposed in this paper. The key point of the algorithm is the most discrepant estimation nodes are selected by the nearest refere...
متن کاملAn Optimal Parallel Algorithm for Node Ranking of Cographs
A ranking of a graph G is a mapping, p, from the vertices of G to the natural numbers such that for every path between any two vertices u and u, uf II, with p(u) = p(u), there exists at least one vertex w on that path with p(w) > p(u) = p(u). The value p(u) of a vertex u is the rank of vertex II. A ranking is optimal if the largest rank assigned is the smallest among all rankings. The optimal r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2005
ISSN: 0161-1712,1687-0425
DOI: 10.1155/ijmms.2005.1405